A Branch-and-price Algorithm for the Vehicle Routing Problem with Time Dependent Travel Times
نویسندگان
چکیده
منابع مشابه
A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
متن کاملA Route Improvement Algorithm for the Vehicle Routing Problem with Time Dependent Travel Times
In urban areas, congestion creates a substantial variation in travel speeds during peak morning and evening hours. This research presents a new solution approach, an iterative route construction and improvement algorithm (IRCI), for the time dependent vehicle routing problem (TDVRP) with hard or soft time windows. Improvements are obtained at a route level; hence the proposed approach does not ...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملThe Vehicle Routing Problem with Real-Time Travel Times
The paper considers a vehicle routing problem with time windows and real-time travel times. We assume the deployment of an information and communication system that is based on mobile technologies, which provides a real-time mobile connection between the dispatching centre and drivers, allows localising vehicles on road, and gives the online overview over traffic conditions. We explicitly incor...
متن کاملThe time-dependent vehicle routing problem with soft time windows and stochastic travel times
This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Industrial Engineers
سال: 2011
ISSN: 1225-0988
DOI: 10.7232/jkiie.2011.37.2.144